منابع مشابه
Broadcasting from multiple originators
We begin an investigation of broadcasting from multiple originators, a variant of broadcasting in which any k vertices may be the originators of a message in a network of n vertices. The requirement is that the message be distributed to all n vertices in minimum time. A minimum k-originator broadcast graph is a graph on n vertices with the fewest edges such that any subset of k vertices can bro...
متن کاملTCP-ABC: From Multiple TCP Connections to Atomic Broadcasting
In this paper, we propose a novel scheme, named as TCP-ABC, which replicates the server side TCP connections among multiple server nodes of a cluster. By guaranteeing atomic request delivery, and consensus on responses, this scheme provides the legacy server applications running on the server nodes with multiple active backups in a transparent fashion. By failing the connections over healthy un...
متن کاملConvexity Problems on Meshes with Multiple Broadcasting
The purpose of this work is to present simple time-optimal algorithms for a number of convexity-related problems on meshes with multiple broadcasting. More speciically, we show that with an n-vertex convex polygon P as input, the tasks of computing the perimeter , the area, the diameter, the width, the modality, the smallest-area enclosing rectangle, and the largest-area inscribed triangle shar...
متن کاملMultiple Message Broadcasting wiht Generalized Fibonacci Trees
We present efficient algorithms for broadcasting multiple messages. We assume n processors, one of which contains m packets that it must broadcast to each of the remaining n 1 processors. The processors communicate in rounds. In one round each processor is able to send one packet to any other processor and receive one packet from any other processor. We give a broadcasting algorithm which requi...
متن کاملBroadcasting Multiple Messages in the Multiport Model
We consider the problem of broadcasting multiple messages from one processor to many processors in the k-port model for message passing systems. In such systems, processors communicate in rounds, where in every round, each processor can send k messages to k processors and receive k messages from k processors. In this paper, we first present a simple and practical algorithm based on variations o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.02.013